Gauss periods as constructions of low complexity normal bases
نویسندگان
چکیده
Optimal normal bases are special cases of the so-called Gauss periods (Disquisitiones Arithmeticae, Articles 343-366); in particular, optimal normal bases are Gauss periods of type (n,1) for any characteristic and type (n,2) for characteristic 2. We present the multiplication tables and complexities of Gauss periods of type (n, t) for all n and t = 3,4,5 over any finite field and give a slightly weaker result for Gauss periods of type (n,6). In addition, we give some general results on the so-called cyclotomic numbers, which are intimately related to the structure of Gauss periods. We also present the general form of a normal basis obtained by the trace of any normal basis in a finite extension field. Then, as an application of the trace construction, we give upper bounds on the complexity of the trace of a Gauss period of type (n,3). Mathematics Subject Classification (2000) 11T99; 11T22, 12E20
منابع مشابه
Abelian Groups, Gauss Periods, and Normal Bases
A result on finite abelian groups is first proved and then used to solve problems in finite fields. Particularly, all finite fields that have normal bases generated by general Gauss periods are characterized and it is shown how to find normal bases of low complexity. Dedicated to Professor Chao Ko on his 90th birthday.
متن کاملMultiplicative Order of Gauss Periods
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.
متن کاملNormal bases via general Gauss periods
Gauss periods have been used successfully as a tool for constructing normal bases in finite fields. Starting from a primitive rth root of unity, one obtains under certain conditions a normal basis for Fqn over Fq, where r is a prime and nk = r− 1 for some integer k. We generalize this construction by allowing arbitrary integers r with nk = φ(r), and find in many cases smaller values of k than i...
متن کاملGauss periods: orders and cryptographical applications
Experimental results on the multiplicative orders of Gauss periods in finite fields are presented. These results indicate that Gauss periods have high order and are often primitive (self-dual) normal elements in finite fields. It is shown that Gauss periods can be exponentiated in quadratic time. An application is an efficient pseudorandom bit generator.
متن کاملVector space bases associated to vanishing ideals of points
In this paper we discuss four different constructions of vector space bases associated to vanishing ideals of points. We show how to compute normal forms with respect to these bases and give new complexity bounds. As an application, we drastically improve the computational algebra approach to the reverse engineering of gene regulatory networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 62 شماره
صفحات -
تاریخ انتشار 2012